[20251207] BOJ / G5 / 벽장문의 이동 / 설진영 #1609
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/2666
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
n개의 벽장 중 2개만 열려있고, 순서대로 특정 벽장을 사용해야 할 때 문 이동 횟수의 최솟값을 구하는 문제
🔍 풀이 방법
dp[idx][a][b] = idx번째 벽장을 사용할 차례이고, 열린 문 위치가 a, b일 때 최소 이동 횟수
열린 문 2개의 위치를 상태로 관리
⏳ 회고
약간 어렵네요